Generalized tournament matrices with the same principal minors
نویسندگان
چکیده
A generalized tournament matrix $M$ is a nonnegative that satisfies $M+M^{t}=J-I$, where $J$ the all ones and $I$ identity matrix. In this paper, characterization of matrices with same principal minors orders $2$, $3$, $4$ given. particular, it proven determine rest minors.
منابع مشابه
Tournament minors
We say a digraph G is a minor of a digraph H if G can be obtained from a subdigraph of H by repeatedly contracting a strongly-connected subdigraph to a vertex. Here, we show the class of all tournaments is a well-quasi-order under minor containment.
متن کاملGenerating and Detecting Matrices with Positive Principal Minors
A brief but concise review of methods to generate P-matrices (i.e., matrices having positive principal minors) is provided and motivated by open problems on P-matrices and the desire to develop and test efficient methods for the detection of P-matrices. Also discussed are operations that leave the class of P-matrices invariant. Some new results and extensions of results regarding P-matrices are...
متن کاملPrincipal Submatrices VII : Further Results Concerning Matrices With Equal Principal Minors *
This paper characte rizes real symmetri c matri ces A s uch that all t X t princ ipal minors a re equal and a ll t X t nonprinc ipal minors a re of fixed sign, for two consecutive values of t less than rank A. It a lso cha rac te rizes matrices A (over an arbitrary fi eld ) in which a ll t X t principal minors are equal and all nonprin cipal t X t minors a re e qua l, for one fixed value of t l...
متن کاملTournament Matrices with Extremal Spectral Properties
For a tournament matrix M of order n, we de ne its walk space, WM , to be SpanfM 1 : j = 0; . . . ; n 1g where 1 is the all ones vector. We show that the dimension of WM equals the number of eigenvalues of M whose real parts are greater than 1=2. We then focus on tournament matrices whose walk space has particularly simple structure, and characterize them in terms of their spectra. Speci cally,...
متن کاملPrincipal minors, Part I: A method for computing all the principal minors of a matrix
An order O(2n) algorithm for computing all the principal minors of an arbitrary n× n complex matrix is motivated and presented, offering an improvement by a factor of n3 over direct computation. The algorithm uses recursive Schur complementation and submatrix extraction, storing the answer in a binary order. An implementation of the algorithm in MATLAB is also given and practical considerations...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear & Multilinear Algebra
سال: 2021
ISSN: ['0308-1087', '1026-7573', '1563-5139']
DOI: https://doi.org/10.1080/03081087.2021.1917500